Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas
نویسنده
چکیده
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks with time-dependent edge weights. This is the first hierarchical speedup technique for time-dependent routing that allows bidirectional query algorithms.
منابع مشابه
Time-Dependent Route Planning
In this paper, we present an overview over existing speed-up techniques for timedependent route planning. Apart from only explaining each technique one by one, we follow a more systematic approach. We identify basic ingredients of these recent techniques and show how they need to be augmented to guarantee correctness in time-dependent networks. With the ingredients adapted, three efficient spee...
متن کاملTime-Dependent Contraction Hierarchies
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks with time-dependent edge weights. This is the first hierarchical speedup technique for timedependent routing that allows bidirectional query algorithms. For large realistic networks with considerable time-dependence (Germ...
متن کاملEngineering Time-Dependent Many-to-Many Shortest Paths Computation
Computing distance tables is important for many logistics problems like the vehicle routing problem (VRP). While shortest distances from all source nodes in S to all target nodes in T are time-independent, travel times are not. We present the first efficient algorithms to compute time-dependent travel time tables in large time-dependent road networks. Our algorithms are based on time-dependent ...
متن کاملParallel Time-Dependent Contraction Hierarchies
Time-Dependent Contraction Hierarchies is a routing technique that solves the shortest path problem in graphs with time-dependent edge weights, that have to satisfy the FIFO property. Although it shows great speedups over Dijkstra’s Algorithm the preprocessing is slow. We present a parallelized version of the preprocessing taking advantage of the multiple cores present in todays CPUs. Nodes ind...
متن کاملEfficient Route Compression for Hybrid Route Planning
We describe an algorithmic framework for lossless compression of route descriptions. This is useful for hybrid route planning where routes are computed by a server and then transmitted to a client device in a car using some mobile radio communication where bandwidth may be low. Compressed routes are represented by only a few via nodes which are the connection points when the route is decomposed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0804.3947 شماره
صفحات -
تاریخ انتشار 2008